Hybrid Possibilistic Networks

نویسندگان

  • Salem Benferhat
  • Salma Smaoui
چکیده

Possibilistic networks are important tools for dealing with uncertain pieces of information. For multiplyconnected networks, it is well known that the inference process is a hard problem. This paper studies a new representation of possibilistic networks, called hybrid possibilistic networks. The uncertainty is no longer represented by local conditional possibility distributions, but by their compact representations which are possibilistic knowledge bases. We show that the inference algorithm in hybrid networks is strictly more efficient than the ones of standard propagation algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possibilistic Networks with Locally Weighted Knowledge Bases

Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility distributions. This paper studies a new representation format, called hybrid possibilistic networks, which cover both standard possibilistic networks and possibilistic knowledge bases. An adaptation of propagation algor...

متن کامل

An Overview of Hybrid Possibilistic Reasoning

The objective of this paper is to introduce the hybrid logic methodology into possibilistic reasoning. It has been well-known that possibilistic logic has some strong modal logic flavor. However, modal logic lacks the capability of referring to states or possible worlds though states are crucial to its semantics. Hybrid logic circumvents the problem by blending the classical logic mechanism int...

متن کامل

Syntactic Computation of Hybrid Possibilistic Conditioning under Uncertain Inputs

We extend hybrid possibilistic conditioning to deal with inputs consisting of a set of triplets composed of propositional formulas, the level at which the formulas should be accepted, and the way in which their models should be revised. We characterize such conditioning using elementary operations on possibility distributions. We then solve a difficult issue that concerns the syntactic computat...

متن کامل

An Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty

The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...

متن کامل

Product-based Causal Networks and Quantitative Possibilistic Bases

In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly there are also two kinds of possibilistic logic: standard (min-based) possibilistic logic and quantitative (product-based) possibilistic logic. Recently, several equivalent transformations between standard possibilistic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005